Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
c |
→ f(g(c)) |
| 2: |
|
f(g(X)) |
→ g(X) |
|
There are 2 dependency pairs:
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006